On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves
نویسندگان
چکیده
We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.
منابع مشابه
Complete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملOn lattice profile of the elliptic curve linear congruential generators
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom number generators. Recently a new lattice test has been introduced by Niederreiter and Winterhof. In this paper, we present a general inequality that is satisfied by any periodic sequence. Then, we analyze the behavior of the linear congruential generators on elliptic curves (abbr. EC-LCG) under this new la...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOn the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and MonteCarlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudor...
متن کاملInferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G ∈ E(IFp) the linear congruential genarator on elliptic curves (EC-LCG) is a sequence (Un) of pseudorandom numbers defined by the relation Un = Un−1 ⊕G = nG⊕ U0, n = 1, 2, . . . , where ⊕ denote the group operation in E(IFp) and U0 ∈ E(IFp) is the initial value or seed. We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 35 شماره
صفحات -
تاریخ انتشار 2005